THE PARAMETER SELECTION PROBLEM FOR MANN’S FIXED POINT ALGORITHM
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFixed Parameter Tractable Algorithm for Firefighting Problem
The firefighter problem is defined as below. A fire initially breaks out at a vertex r on a graph G. In each step, a firefighter chooses to protect one vertex, which is not yet burnt. And the fire spreads out to its unprotected neighboring vertices afterwards. The objective of the problem is to choose a sequence of vertices to protect, in order to save maximum number of vertices from the fire. ...
متن کاملA fixed-parameter algorithm for the minimum Manhattan network problem
A Manhattan network for a finite set P of n points in the plane is a geometric graph such that its vertex set contains P , its edges are axis-parallel and non-crossing and, for any two points p and q in P , there exists a path in the network connecting p and q whose length equals the l1-distance between p and q. The problem of computing a Manhattan network of minimum total edge length for a giv...
متن کاملA recursive algorithm for the infinity-norm fixed point problem
We present the PFix algorithm for the fixed point problem f ðxÞ 1⁄4 x on a nonempty domain 1⁄2a; b ; where dX1; a; bAR ; and f is a Lipschitz continuous function with respect to the infinity norm, with constant qp1: The computed approximation x̃ satisfies the residual criterion jj f ðx̃Þ x̃jjNpe; where e40: In general, the algorithm requires no more than Pd i1⁄41s i function component evaluations,...
متن کاملHybrid steepest iterative algorithm for a hierarchical fixed point problem
The purpose of this work is to introduce and study an iterative method to approximate solutions of a hierarchical fixed point problem and a variational inequality problem involving a finite family of nonexpansive mappings on a real Hilbert space. Further, we prove that the sequence generated by the proposed iterative method converges to a solution of the hierarchical fixed point problem for a f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2008
ISSN: 1027-5487
DOI: 10.11650/twjm/1500405126